Cover tree - PDFSEARCH.IO - Document Search Engine

Cover tree
Results: 252

#	Item
61	CCCG 2011, Toronto ON, August 10–12, 2011 Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash∗ Paz Carmi† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-15 18:22:15 NP-complete problems Spanning tree Steiner tree problem NP-hard problems Minimum spanning tree Tree Vertex cover Rectilinear Steiner tree Connectivity Graph theory Theoretical computer science Mathematics
62	Tractable Parameterizations for the Minimum Linear Arrangement Problem Michael R. Fellows1 , Danny Hermelin2 , Frances Rosamond1 , and Hadas Shachnai3 1 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-06-22 19:48:39 NP-complete problems Vertex cover Tree decomposition Graph Voltage graph Dominating set Graph theory Theoretical computer science Mathematics
63	Filtering: A Method for Solving Graph Problems in MapReduce Silvio Lattanzi∗ Benjamin Moseley† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2011-04-18 22:39:50 NP-complete problems Combinatorial optimization Spanning tree Matching Vertex cover Graph coloring Minimum spanning tree Minimum cut Connected component Theoretical computer science Graph theory Mathematics
64	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Network Design Subject to Facility Location J. Bhadury∗, R. Chandrasekaran†, L. Gewali‡ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:36 NP-complete problems Spanning tree Network theory Minimum spanning tree Shortest path problem Vertex cover Tree Steiner tree problem Widest path problem Graph theory Theoretical computer science Mathematics
65	CCCG 2011, Toronto ON, August 10–12, 2011 Euclidean Movement Minimization Nima Anari∗ MohammadAmin Fazli† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:16 NP-complete problems Hamiltonian path Vertex cover Independent set Matching Minimum spanning tree Dominating set Graph coloring Theoretical computer science Graph theory Mathematics
66	Wyndano’s Cloak by A. R. Silverberry Tree Tunnel Press Add to Reading List Source URL: book-cover-design.com Language: English - Date: 2015-04-03 16:57:18 Capitola California Sherry
67	CCCG 2011, Toronto ON, August 10–12, 2011 Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash∗ Paz Carmi† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-15 18:22:15 NP-complete problems Spanning tree Steiner tree problem NP-hard problems Minimum spanning tree Tree Vertex cover Rectilinear Steiner tree Connectivity Graph theory Theoretical computer science Mathematics
68	Parameterized Approximation via Fidelity Preserving Transformations Michael R. Fellows1 , Ariel Kulik2 , Frances Rosamond1 , and Hadas Shachnai3? 1 School of Engineering and IT, Charles Darwin Univ., Darwin, NT Australi Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-03-01 11:15:08 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Kernelization Dominating set Vertex cover Time complexity Steiner tree problem Theoretical computer science Computational complexity theory Applied mathematics
69	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximation Algorithms for the Minimum-Length Corridor and Related Problems Arturo Gonzalez-Gutierrez∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:22 NP-complete problems Operations research Approximation algorithm Travelling salesman problem APX Steiner tree problem Algorithm Set cover problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
70	0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 Add to Reading List Source URL: mrfellows.net Language: English - Date: 2009-09-08 08:50:37 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Kernelization Dominating set Feedback vertex set Vertex cover Tree decomposition Theoretical computer science Graph theory Computational complexity theory

UPDATE